HUFFMAN CODING AS A NONLINEAR DYNAMICAL SYSTEM
نویسندگان
چکیده
منابع مشابه
Fault Tolerant Huffman Coding for JPEG Image Coding System
−In this paper, the tolerance of Huffman Coding to memory faults is considered. Many pointer-based and array-based data structures are highly nonresilient to faults. A single fault in a memory array or atree node may result in loss of entire data or an incorrect code stream. In this paper, a fault tolerant designscheme is developed to protect the JPEG image compression system.
متن کاملComments on ‘‘arithmetic coding as a non-linear dynamical system’’
Nagaraj et al. [1,2] present a skewed-non-linear generalized Luroth series (s-nGLS) framework. S-nGLS uses non-linear maps for GLS to introduce a security parameter a which is used to build a keyspace for image or data encryption. The map introduces non-linearity to the system to add an ‘‘encryption key parameter’’. The skew is added to achieve optimal compression efficiency. s-nGLS used as suc...
متن کاملQuantum-inspired Huffman Coding
ABSTRACT Huffman Compression, also known as Huffman Coding, is one of many compression techniques in use today. The two important features of Huffman coding are instantaneousness that is the codes can be interpreted as soon as they are received and variable length that is a most frequent symbol has length smaller than a less frequent symbol. The traditional Huffman coding has two procedures: co...
متن کاملGreedy Algorithms: Huffman Coding
Greedy Algorithms: In an optimization problem, we are given an input and asked to compute a structure, subject to various constraints, in a manner that either minimizes cost or maximizes profit. Such problems arise in many applications of science and engineering. Given an optimization problem, we are often faced with the question of whether the problem can be solved efficiently (as opposed to a...
متن کاملDynamic Huffman Coding
Given nonnegative weights (wr, . . . , w,,), the well-known algorithm of Huffman [2] can be used to construct a binary tree with n external nodes and n 1 internal nodes, where the external nodes are labeled with the weights (wr, . . . , w,) in some order. Huffman’s tree has the minimum value of WJ, + * * . + w,,l, over all such binary trees, where lj is the level at which wj occurs in the tree....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Bifurcation and Chaos
سال: 2011
ISSN: 0218-1274,1793-6551
DOI: 10.1142/s0218127411029392